Orthogonal variance decomposition based feature selection

نویسندگان

چکیده

Existing feature selection methods fail to properly account for interactions between features. In this paper, we attempt remedy issue by using orthogonal variance decomposition evaluate The orthogonality of the allows us directly calculate total contribution each output variance. As a result, obtain an efficient and technically sound algorithm which takes into interactions. proposed has low computational complexity compared other used in literature. Numerical experiments demonstrate that our method accurately identifies relevant features improves accuracy numerical models.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Unique Orthogonal Variance Decomposition

Let e and Σ be respectively the vector of shocks and its variance covariance matrix in a linear system of equations in reduced form. This article shows that a unique orthogonal variance decomposition can be obtained if we impose a restriction that maximizes the trace of A, a positive definite matrix such that e Az = where z is vector of uncorrelated shocks with unit variance. Such a restriction...

متن کامل

Orthogonal Principal Feature Selection

This paper presents a feature selection method based on the popular transformation approach: principal component analysis (PCA). It is popular because it finds the optimal solution to several objective functions (including maximum variance and minimum sum-squared-error), and also because it provides an orthogonal basis solution. However, PCA as a dimensionality reduction algorithm do not explic...

متن کامل

On Feature Selection, Bias-Variance, and Bagging

We examine the mechanism by which feature selection improves the accuracy of supervised learning. An empirical bias/variance analysis as feature selection progresses indicates that the most accurate feature set corresponds to the best bias-variance trade-off point for the learning algorithm. Often, this is not the point separating relevant from irrelevant features, but where increasing variance...

متن کامل

Decision Tree Decomposition-based Complex Feature Selection for Text Chunking

Incorporating a method of feature selection into a classification model often provides a number of advantages. In this paper we propose a new feature selection method based on the discriminative perspective of improving the classification accuracy. The feature selection method is developed for a classification model for text chunking. For effective feature selection, we utilize a decision tree ...

متن کامل

Two novel feature selection methods based on decomposition and composition

0957-4174/$ see front matter 2010 Elsevier Ltd. A doi:10.1016/j.eswa.2010.03.039 * Corresponding author. E-mail address: [email protected] (N. Jiao). Feature selection is a key issue in the research on rough set theory. However, when handling large-scale data, many current feature selection methods based on rough set theory are incapable. In this paper, two novel feature selection methods are put ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Expert Systems With Applications

سال: 2021

ISSN: ['1873-6793', '0957-4174']

DOI: https://doi.org/10.1016/j.eswa.2021.115191